Realistic Cost for the Model of Coherent Computing

For the model of so-called coherent computing recently proposed by Yamamoto et al. [Y. Yamamoto et al., New Gen. Comput. 30 (2012) 327-355], a theoretical analysis of the success probability is given. Although it was claimed as their prospect that the Ising spin configuration problem would be efficiently solvable in the model, here it is shown that the probability of finding a desired spin configuration decreases exponentially in the number of spins for certain hard instances. The model is thus physically unfeasible for solving the problem within a polynomial cost

Population-only decay map for n-qubit n-partite inseparability detection

We introduce a new positive linear map for a single qubit. This map is a decay only in populations of a single-qubit density operator. It is shown that an n-fold product of this map may be used for a detection of n-partite inseparability of an n-qubit density operator (i.e., detection of impossibility of representing a density operator in the form of a convex combination of products of density operators of individual qubits). This product map is also investigated in relation to a variant of the entanglement detection method mentioned by Laskowski and Zukowski.Comment: 5 pages, 1 figure, RevTex4, v2 minor grammatical changes, typos correcte